A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami

نویسندگان

  • Hector A. Cardenas
  • Chester Holtz
  • Maria Janczak
  • Philip Meyers
  • Nathaniel S. Potrepka
چکیده

In this work, we critique two papers, “A Polynomial-Time Solution to the Clique Problem” by Tamta, Pande, and Dhami [3], and “A Polynomial-Time Algorithm For Solving Clique Problems” by LaPlante [1]. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully established that P = NP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem

Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.

متن کامل

Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem

Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reduction from clique problem. In the present work,an effort is being made to solve this particular case of CMFNIP in polynomial time. Direct implication of this solution is that the clique problem gets solved in polynomial ...

متن کامل

A Polynomial Time Solution to the Clique Problem

The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.

متن کامل

Generation, Implementation and Appraisal of an N-gram based Stemming Algorithm

A language independent stemmer has always been looked for. Single N-gram tokenization technique works well, however, it often generates stems that start with intermediate characters, rather than initial ones. We present a novel technique that takes the concept of N-gram stemming one step ahead and compare our method with an established algorithm in the field, Porter’s Stemmer. Results indicate ...

متن کامل

Suffix Stripping Problem as an Optimization Problem

Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms targeting this problem have been developed in a haphazard manner. In this work, we model this problem as an optimization problem. An Integer Program is being developed to overcome the shortcomings of the existing approa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1504.06890  شماره 

صفحات  -

تاریخ انتشار 2015